The Capacitated Mobile Facility Location Problem

نویسندگان

  • S. Raghavan
  • Mustafa Sahin
چکیده

The capacitated mobile facility location problem (CMFLP) arises in logistics planning of community outreach programs delivered via mobile facilities. It adds capacity restrictions to the mobile facility location problem introduced previously by Demaine et al. [2009], thereby extending the problem to a practical setting. In the problem, one seeks to relocate (or move) a set of existing facilities and assign clients to these facilities while respecting capacities so that the weighted sum of facility movement costs and the client travel costs (each to its assigned facility) is minimized. We provide two integer programming formulations for the CMFLP. The first is on a layered graph, while the second is a set partitioning formulation. We prove that the linear relaxation of the set partitioning formulation provides a tighter lower bound to the CMFLP than the linear relaxation of the layered graph formulation. We then develop a branch-and-price algorithm on the set partitioning formulation. We find that the branch-and-price procedure is particularly effective both in terms of solution quality and running time, when the ratio of the number of clients to the number of facilities is small and the facility capacities are tight. Finally, we present two heuristic approaches for the CMFLP. One is a LP rounding heuristic, and the other is based on a natural problem decomposition on the layered graph.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Hybrid Algorithm to Optimize Stochastic-fuzzy Capacitated Multi-Facility Location-allocation Problem

Facility location-allocation models are used in a widespread variety of applications to determine the number of required facility along with the relevant allocation process. In this paper, a new mathematical model for the capacitated multi-facility location-allocation problem with probabilistic customer's locations and fuzzy customer’s demands under the Hurwicz criterion is proposed. Thi...

متن کامل

A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...

متن کامل

A Nonlinear Model for a Capacitated Location-allocation Problem with Bernoulli Demand using Sub-sources

This study presents a capacitated multi-facility location-allocation problem with stochastic demands based on a well-known distribution function. In this discrete environment, besides the capacitated facilities, we can employee the capacitated sub-source of each facility for satisfying demands of customers. The objective function is to find the optimal locations of facilities among a finite num...

متن کامل

Heuristic Methods Based on MINLP Formulation for Reliable Capacitated Facility Location Problems

This paper addresses a reliable facility location problem with considering facility capacity constraints. In reliable facility location problem some facilities may become unavailable from time to time. If a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. Hence, the fail of facilities leads to disruptions in facility location dec...

متن کامل

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...

متن کامل

A fuzzy capacitated facility location-network design model: A hybrid firefly and invasive weed optimization (FIWO) solution

Facility location-network design (FLND) problem, which determines the location of facilities and also communication links between the demand and facility nodes, is arisen from the combination of the facility location and network design problems. This paper deals with fuzzy capacitated facility location-network design model which aims to select the facilities and candidate links in a way that yi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016